A multiobjective memetic algorithm for PPI network alignment
نویسندگان
چکیده
MOTIVATION There recently has been great interest in aligning protein-protein interaction (PPI) networks to identify potentially orthologous proteins between species. It is thought that the topological information contained in these networks will yield better orthology predictions than sequence similarity alone. Recent work has found that existing aligners have difficulty making use of both topological and sequence similarity when aligning, with either one or the other being better matched. This can be at least partially attributed to the fact that existing aligners try to combine these two potentially conflicting objectives into a single objective. RESULTS We present Optnetalign, a multiobjective memetic algorithm for the problem of PPI network alignment that uses extremely efficient swap-based local search, mutation and crossover operations to create a population of alignments. This algorithm optimizes the conflicting goals of topological and sequence similarity using the concept of Pareto dominance, exploring the tradeoff between the two objectives as it runs. This allows us to produce many high-quality candidate alignments in a single run. Our algorithm produces alignments that are much better compromises between topological and biological match quality than previous work, while better characterizing the diversity of possible good alignments between two networks. Our aligner's results have several interesting implications for future research on alignment evaluation, the design of network alignment objectives and the interpretation of alignment results. AVAILABILITY AND IMPLEMENTATION The C++ source code to our program, along with compilation and usage instructions, is available at https://github.com/crclark/optnetaligncpp/
منابع مشابه
Systems biology A multiobjective memetic algorithm for PPI network alignment
Motivation: There recently has been great interest in aligning protein–protein interaction (PPI) networks to identify potentially orthologous proteins between species. It is thought that the topological information contained in these networks will yield better orthology predictions than sequence similarity alone. Recent work has found that existing aligners have difficulty making use of both to...
متن کاملMultiobjective Image Data Hiding Based on Neural Networks and Memetic Optimization
This paper presents a hybridization of neural networks and multiobjective memetic optimization for an adaptive, robust, and perceptual data hiding method for colour images. The multiobjective optimization problem of a robust and perceptual image data hiding is introduced. In particular, trade-off factors in designing an optimal image data hiding to maximize the quality of watermarked images and...
متن کاملMemetic multiobjective particle swarm optimization-based radial basis function network for classification problems
This paper presents a new multiobjective evolutionary algorithm applied to a radial basis function (RBF) network design based on mult iobjective particle swarm optimization augmented with local search features. The algorithm is named the memetic multiobjective particle swarm optimization RBF network (MPSON) because it integrates the accuracy and structure of an RBF network. The proposed algorit...
متن کاملMEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the fir...
متن کاملUse of biased neighborhood structures in multiobjective memetic algorithms
In this paper, we examine the use of biased neighborhood structures for local search in multiobjective memetic algorithms. Under a biased neighborhood structure, each neighbor of the current solution has a different probability to be sampled in local search. In standard local search, all neighbors of the current solution usually have the same probability because they are randomly sampled. On th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bioinformatics
دوره 31 12 شماره
صفحات -
تاریخ انتشار 2015